Combat Outcome Prediction for RTS Games
نویسندگان
چکیده
Marius Stanescu, Nicolas A. Barriga and Michael Buro [1 leave this spacer to make page count accurate] [2 leave this spacer to make page count accurate] [3 leave this spacer to make page count accurate] [4 leave this spacer to make page count accurate] [5 leave this spacer to make page count accurate] [6 leave this spacer to make page count accurate] [7 leave this spacer to make page count accurate] [8 leave this spacer to make page count accurate] [9 leave this spacer to make page count accurate] [10 leave this spacer to make page count accurate] [11 leave this spacer to make page count accurate] [12 leave this spacer to make page count accurate] [13 leave this spacer to make page count accurate] [14 leave this spacer to make page count accurate] [15 leave this spacer to make page count accurate] [16 leave this spacer to make page count accurate] [17 leave this spacer to make page count accurate] [18 leave this spacer to make page count accurate] [19 leave this spacer to make page count accurate] [20 leave this spacer to make page count accurate]
منابع مشابه
The effect of latency on user performance in Real-Time Strategy games
Latency on the Internet is a well-known problem for interactive applications. The growth in interactive network games brings an increased importance in understanding the effects of latency on user performance. Classes of network games such as First Person Shooters (FPS) and Real-Time Strategy (RTS) differ in their user interaction model and hence susceptibility to latency. While previous work h...
متن کاملAutomatic Learning of Combat Models for RTS Games
Game tree search algorithms, such as Monte Carlo Tree Search (MCTS), require access to a forward model (or “simulator”) of the game at hand. However, in some games such forward model is not readily available. In this paper we address the problem of automatically learning forward models (more specifically, combats models) for two-player attrition games. We report experiments comparing several ap...
متن کاملStarCraft Unit Motion: Analysis and Search Enhancements
Real-time strategy (RTS) games pose challenges to AI research on many levels, ranging from selecting targets in unit combat situations, over efficient multi-unit pathfinding, to high-level economic decisions. Due to the complexity of RTS games, writing competitive AI systems for these games requires high speed adaptive algorithms and simplified models
متن کاملReal-Time Strategy Game Competitions
106 AI MAGAZINE RTS games — such as StarCraft by Blizzard Entertainment and Command and Conquer by Electronic Arts — are popular video games that can be described as real-time war simulations in which players delegate units under their command to gather resources, build structures, combat and support units, scout opponent locations, and attack. The winner of an RTS game usually is the player or...
متن کاملIncorporating Search Algorithms into RTS Game Agents
Real-time strategy (RTS) games are known to be one of the most complex game genres for humans to play, as well as one of the most difficult games for computer AI agents to play well. To tackle the task of applying AI to RTS games, recent techniques have focused on a divide-and-conquer approach, splitting the game into strategic components, and developing separate systems to solve each. This tre...
متن کاملUsing Lanchester Attrition Laws for Combat Prediction in StarCraft
Smart decision making at the tactical level is important for Artificial Intelligence (AI) agents to perform well in the domain of real-time strategy (RTS) games. Winning battles is crucial in RTS games, and while ahumans can decide when and how to attack based on their experience, it is challenging for AI agents to estimate combat outcomes accurately. A few existing models address this problem ...
متن کامل